Formalization of the Equivalent Transformation Computation Model
نویسندگان
چکیده
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain and defines a set of queries of interest; a program is a set of prioritized transformation rules; and computation consists in successive reduction of queries using meaningpreserving transformation with respect to given background knowledge. This paper presents a formalization of the ET model from the viewpoint of program synthesis, where not only computation but also program correctness and correctness relations are of central importance. The notion of program correctness defines “what it means for a program to be correct with respect to a specification”, while a correctness relation provides guidance on “how to obtain such a program”. The correctness relation of the ET model is established, based on which how the fundamental structure of the ET model facilitates program synthesis is discussed. Program synthesis strategies in the ET model are illustrated.
منابع مشابه
The Performance of an Hexahedron C* Element in Finite Element Analysis
The performance of an 8-noded hexahedron C1* element in elasticity is investigated. Three translational displacements and their derivatives as strain in each direction are considered as degrees of freedom (d.o.f.’s) at each node. The geometric mapping is enforced using a C0 element with no derivative as nodal d.o.f.’s . The stiffness matrix of the element is also computed using a transformation...
متن کاملA Theoretical Foundation of Program Synthesis by Equivalent Transformation
Equivalent transformation ET is useful for synthesis and transformation of programs However it is not so clear what seman tics should be preserved in synthesis and transformation of programs in logic and functional programming which come from the disagreement of computation models inference or evaluation and equivalent transfor mation To overcome the di culty we adopt a new computation model ca...
متن کاملAn alternative transformation in ranking using l1-norm in data envelopment analysis
Jahanshahloo et al. (Appl Math Comput 153:215–224, 2004) propose a method for ranking extremely efficient decision making units (DMUs) in data envelopment analysis (DEA) using super-efficiency technique and l1-norm and they show that the presented method is able to eliminate the existing difficulties in some methods. This paper suggests an alternative transformation to convert the nonlinear mod...
متن کاملTasks, Types and Tactics for Local Computation Systems
We present a formalization in Coq of local computations, a model for distributed computing based on graph relabelling. This formalization allows one to prove the correctness of distributed algorithms, as well as to compare various synchronisation and termination detection modes. We illustrate our approach by two impossibility proofs, and by a certified algorithm transformation.
متن کاملThree New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JACIII
دوره 10 شماره
صفحات -
تاریخ انتشار 2006